Taking Consensus of Signed Distance Field for Complementing Unobservable Surface

نویسندگان

  • Ryusuke Sagawa
  • Katsushi Ikeuchi
چکیده

When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model for various applications. We propose a novel method to fill holes and gaps and complement such an incomplete model. We use a signed distance field (SDF) as an intermediate representation, which stores Euclidean signed distances from a voxel to the nearest point of the mesh model. Since the signs of a SDF become unstable around holes or gaps, we take a consensus of the signed distances of neighbor voxels by estimating the consistency of the SDF. Once we make the SDF consistent, we can efficiently fill holes and gaps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taking Consensus of Signed Distance Field for Hole Filling

When we use range finders to observe the shape of an object, many occluded areas may occur. These become holes and gaps in the model and make it undesirable to utilize the model for various applications. We propose a novel method to fill holes and gaps and complement such an incomplete model. We use a signed distance field (SDF) as an intermediate representation, which stores Euclidean signed d...

متن کامل

Geometric and Photometric Merging for Large-scale Objects

In this thesis, we consider the geometric and photometric modeling of large-scale and intricately shaped objects, such as cultural heritage objects. When modeling such objects, new issues occurred during the modeling steps which had not been considered in the previous research conducted on the modeling of small, indoor objects. Since the entire data of these objects cannot be obtained by a sing...

متن کامل

Signed distance fields for polygon soup meshes

Many meshes in computer animation practice are meant to approximate solid objects, but the provided triangular geometry is often unoriented, non-manifold or contains self-intersections, causing inside/outside of objects to be mathematically ill-defined. We describe a robust and efficient automatic approach to define and compute a signed distance field for arbitrary triangular geometry. Starting...

متن کامل

Computing Local Signed Distance Fields for Large Polygonal Models

The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is more effective to build a local distance field only within a narrow band around the surface that holds local geometric information for the model. In this paper, we present a novel technique to construct a volumetric l...

متن کامل

Piecewise Linear Approximation of Signed Distance Fields

The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003